Hybrid Steepest Descent Method with Variable Parameters for General Variational Inequalities
نویسندگان
چکیده
Let H be a real Hilbert space and let C be a nonempty closed convex subset of H . Let F :H →H be an operator such that for some constants k,η > 0, F is k-Lipschitzian and η-strongly monotone on C; that is, F satisfies the following inequalities: ‖Fx− Fy‖ ≤ k‖x− y‖ and 〈Fx− Fy,x− y〉 ≥ η‖x− y‖2 for all x, y ∈ C, respectively. Recall that T is nonexpansive if ‖Tx−Ty‖ ≤ ‖x− y‖ for all x, y ∈H . We consider the following variational inequality problem: find a point u∗ ∈ C such that
منابع مشابه
Hybrid steepest-descent method with sequential and functional errors in Banach space
Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...
متن کاملAn Algorithm for Solving Triple Hierarchical Pseudomonotone Variational Inequalities
In this paper, we introduce and analyze a hybrid steepest-descent extragradient algorithm for solving triple hierarchical pseudomonotone variational inequalities in a real Hilbert space. The proposed algorithm is based on Korpelevich’s extragradient method, Mann’s iteration method, hybrid steepest-descent method and Halpern’s iteration method. Under mild conditions, the strong convergence of th...
متن کاملA Generalized Hybrid Steepest-Descent Method for Variational Inequalities in Banach Spaces
The hybrid steepest-descent method introduced by Yamada 2001 is an algorithmic solution to the variational inequality problem over the fixed point set of nonlinear mapping and applicable to a broad range of convexly constrained nonlinear inverse problems in real Hilbert spaces. Lehdili and Moudafi 1996 introduced the new prox-Tikhonov regularization method for proximal point algorithm to genera...
متن کاملStrong Weak Convergence Theorems of Implicit Hybrid Steepest-descent Methods for Variational Inequalities
Assume that F is a nonlinear operator on a real Hilbert space H which is strongly monotone and Lipschitzian with constants η > 0 and κ > 0, respectively on a nonempty closed convex subset C of H . Assume also that C is the intersection of the fixed point sets of a finite number of nonexpansive mappings on H . We develop an implicit hybrid steepest-descent method which generates an iterative seq...
متن کاملEfficient implementation of a modified and relaxed hybrid steepest-descent method for a type of variational inequality
To reduce the difficulty and complexity in computing the projection from a real Hilbert space onto a nonempty closed convex subset, researchers have provided a hybrid steepest-descent method for solving VI(F,K) and a subsequent three-step relaxed version of this method. In a previous study, the latter was used to develop a modified and relaxed hybrid steepest-descent (MRHSD) method. However, ch...
متن کامل